A <V, p>-Policy Queueing System with Startup/Closedown Times
نویسنده
چکیده
This study considers a -policy Geo/G/1 queue with startup and closedown times. The -policy operates as follows. On completion of the vacation, if there are customers in the queue, the server is either to activate with probability p or to stay dormant in the system with probability 1-p for waiting a new arrival; and if no customer presents in the queue, the server obeys classical single vacation policy to stay dormant in the system until one arrival. We give analytic expressions for the stationary system size distributions of the various states of the server, the length distributions of various state periods and the queue waiting time distribution of an arbitrary customer. Furthermore, we also demonstrate the stochastic decomposition property of the system size and waiting time in the queue. Some numerical examples of the mean system sizes and the mean waiting times in the queue with respect to startup/closedown times, startup times, closedown times, and both no startup and no closedown times, are presented. Finally, with the vacation of fixed length time (say T ), the long run average cost function per unit time is analytically developed to determine the joint optimal values of T and p at a minimum cost.
منابع مشابه
Random N-Policy Geo/G/1 Queue with Startup and Closedown Times
This study investigates a random N-policy Geo/G/1 queue with startup and closedown times. N is newly determined every time a new cycle begins. When random N customers are accumulated, the server is immediately turned on but is temporarily unavailable to the waiting customers. It needs a startup time before starting providing service. After all customers in the system are served exhaustively, th...
متن کاملAnalysis of a Geo/G/1 Queueing System with a Generalized N-Policy and Setup-Closedown Times
Abstract: We analyze a discrete-time single-server queueing system whose arrival stream is a Bernoulli process and service times are generally distributed. An extension of the N -policy is considered: the server remains idle till the queue length becomes 1 i ≥ with probability i θ . After the idle (vacation) period, the server needs a random amount of startup time before serving. Moreover, afte...
متن کاملInternational Journal of Management Science and Engineering Management
In this paper, we discuss the discrete-time Geom/G/1 queue with multiple adaptive vacations and server setup/closedown times. We consider two types of closedown time policies which differ from each other in the completion instant of the closedown times and contrast the effects of them on the queueing system. We derive the probability generating functions (PGFs) and stochastic decomposition resu...
متن کاملOptimal control of an N - policy two - phase M X / M / 1 queueing system with server startup subject to the server breakdowns and delayed repair
In most queueing systems the server may be subjected to lengthy and unpredictable breakdowns while serving a customer. For instance, in manufacturing systems the machine may breakdown due to malfunction or job related problems; in computer systems, the machine may be subject to scheduled backups and predicted failures. In these systems, server breakdown results in a period of server unavailabil...
متن کاملOptimal Strategy Analysis of an N-Policy Two-Phase M/Ek/1 Queueing System with Server Breakdowns and Gating
Two-phase M/Ek/1 queueing system with N -policy for exhaustive batch service with gating, and server startups and breakdowns is studied in this paper. The customers arrive individually according to a Poisson process and waiting customers receive batch service all at a time in the first phase and are served individually in the second phase. The server is turned off each time the system empties, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015